Multiple context-free tree grammars: Lexicalization and characterization
نویسندگان
چکیده
منابع مشابه
Multiple Context-Free Tree Grammars: Lexicalization and Characterization
Multiple (simple) context-free tree grammars are investigated, where “simple” means “linear and nondeleting”. Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one (generating the same tree language) in which each rule of the grammar contains a lexical symbol. Due to this transformation, the rank of the nonterm...
متن کاملMultiple Context-Free Grammars
Multiple context-free grammar (MCFG) is a weakly contextsensitive grammar formalism that deals with tuples of strings. An MCFG is called m-MCFG if all tuples have at most m components. In this summary I will outline that the expressivity of m-MCFG’s increases with the parameter m and that the class of tree-adjoining languages is properly included in the class of 2-multiple context-free language...
متن کاملSynchronous Context-Free Tree Grammars
We consider pairs of context-free tree grammars combined through synchronous rewriting. The resulting formalism is at least as powerful as synchronous tree adjoining grammars and linear, nondeleting macro tree transducers, while the parsing complexity remains polynomial. Its power is subsumed by context-free hypergraph grammars. The new formalism has an alternative characterization in terms of ...
متن کاملMultiple Context Free Grammars
Multiple context-free grammars (MCFGs) are a generalization of context-free grammars that deals with tuples of strings. This is a brief survey of MCFGs, their properties, and their relations to other formalisms. We outline simple constructions to convert MCFGs to Hyperedge Replacement Grammars (HRGs) and to Deterministic Tree Walking Transducers (DTWTs), and also to simulate DTWTs by MCFGs. We ...
متن کاملMultiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars
Strong lexicalization is the process of turning a grammar generating trees into an equivalent one, in which all rules contain a terminal leaf. It is known that tree adjoining grammars cannot be strongly lexicalized, whereas the more powerful simple context-free tree grammars can. It is demonstrated that multiple simple context-free tree grammars are as expressive as multi-component tree adjoini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.03.014